2N Noncollinear points determine at least 2N directions
نویسندگان
چکیده
منابع مشابه
Explicit tensors of border rank at least 2n-1
For odd m, I write down tensors in C m ⊗C m ⊗C m of border rank at least 2m − 1, showing the non-triviality of the Young-flattening equations of [6] that vanish on the matrix multiplication tensor. I also study the border rank of the tensors of [1] and [3]. I show the tensors T 2 k ∈ C k ⊗C 2 k ⊗C 2 k , of [1], despite having rank equal to 2 k+1 − 1, have border rank equal to 2 k. I show the eq...
متن کاملResidue-to-binary arithmetic converter for moduli set {2n -1, 2n, 2n+1, 2n+1 -1}
This paper presents a new reverse converter architecture for the moduli set { 2 -1, 2, 2 +1, 2-1}. It exploits the special properties of the numbers of the form 1 2 ± , and extends the dynamic range of the present triple moduli based systems. Here we use a combination of CRT and MRC for reverse conversion. With a pipelined system the throughput rate is that of a single 3n+1 bit binary adder delay.
متن کاملA reverse converter for the new 4-moduli set {2n + 3, 2n + 2, 2n + 1, 2n}
In this paper, we propose a new 4-moduli set {2n+ 3, 2n+ 2, 2n+ 1, 2n} that increases the dynamic range and the processing parallelism enabling efficient reverse conversion. First, we assume a general 4-moduli set {mi}i=1,4, m1 > m2 > m3 > m4, with the dynamic range M = ∏4 i=1 mi and introduce a modified Chinese Remainder Theorem (CRT) that requires mod-m4 instead of mod-M calculations. Subsequ...
متن کاملIntriguing Sets of Points of Q(2n, 2) \Q +(2n - 1, 2)
Intriguing sets of vertices have been studied for several classes of strongly regular graphs. In the present paper, we study intriguing sets for the graphs Γn, n ≥ 2, which are defined as follows. Suppose Q(2n, 2), n ≥ 2, is a nonsingular parabolic quadric of PG(2n, 2) and Q+(2n − 1, 2) is a nonsingular hyperbolic quadric obtained by intersecting Q(2n, 2) with a suitable nontangent hyperplane. ...
متن کاملFast Sign Detection Algorithm for the RNS Moduli Set 2n+1-1, 2n-1, 2n
This brief presents a fast sign detection algorithm for the residue number system moduli set {2n+1 − 1, 2n − 1, 2n}. First, a sign detection algorithm for the restricted moduli set is described. The new algorithm allows for parallel implementation and consists exclusively of modulo 2n additions. Then, a sign detection unit for the moduli set {2n+1 − 1, 2n − 1, 2n} is proposed based on the new s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1982
ISSN: 0097-3165
DOI: 10.1016/0097-3165(82)90045-0